Termination w.r.t. Q proof of TRS/Endrullispair2simple1.trs

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

The TRS R consists of the following rules:

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

The TRS R consists of the following rules:

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].

The following pairs can be oriented strictly and are deleted.

The remaining pairs can at least be oriented weakly.

Used ordering: Polynomial Order [17,21] with Interpretation:

POL( P₂(x₁, x₂) ) = max{0, x₂ - 1}

POL( p₂(x₁, x₂) ) = x₁ + x₂ + 1

POL( a₁(x₁) ) = 1

The following usable rules [14] were oriented:

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ QDPOrderProof

        ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

The TRS R consists of the following rules:

Q is empty.
We have to consider all minimal (P,Q,R)-chains.